\??accurate" Failure Detectors
نویسنده
چکیده
The knowledge about failures needed to solve distributed agreement problems can be expressed in terms of completeness and accuracy properties of failure detectors introduced by Chandra and Toueg. The accuracy properties they have considered restrict the false suspicions that can be made by all the processes in the system. In this paper, we deene \??accurate" failure detectors, whose accuracy properties (only) restrict the false suspicions that can be made by a subset ? of the processes. We discuss the relations between the classes of ??accurate failure detectors, and the classes of failure detectors deened by Chandra and Toueg. Then we point out the impact of these relations on the solvability of agreement problems.
منابع مشابه
On Accrual Failure Detectors
Traditionally, failure detectors have considered a binary model whereby a given process can be either trusted or suspected. This paper defines a family of failure detectors, called accrual failure detectors, that revisits this interaction model. Accrual failure detectors associate to each process a real value representing a suspicion level. An important advantage of accrual failure detectors ov...
متن کاملDefinition and properties of accrual failure detectors : an overview
Ensuring fast and accurate failure detection is a fundamental issue for building efficient fault-tolerant distributed systems. In an effort to make fault-tolerant applications easier to implement, we are trying to provide failure detection as a generic Internet service, similar to what was done very successfully with NTP (network time protocol) for clock synchronization. To do so, we must revis...
متن کاملEvaluation of Failure Detectors: A Decision Theory Approach
This paper proposes a method of analysis for evaluating failure detectors. The method can be applied to compare the performance of failure detectors in a given environment. Through a cost analysis approach, this method creates a cost metric, averagelost, which might tackle with comparing two failure detectors. Through the consequent experiment, we conclude that the value of a failure detector d...
متن کاملWeakening Failure Detectors for k -Set Agreement Via the Partition Approach
In this paper, we propose the partition approach and define several new classes of partitioned failure detectors weaker than existing failure detectors for the k-set agreement problem in both the shared-memory model and the message-passing model. In the shared-memory model with n + 1 processes, for any 2 ≤ k ≤ n, we first propose a partitioned failure detector ΠΩk that solves k-set agreement wi...
متن کاملOn the Weakest Failure Detector for Non-Blocking Atomic Commit
This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes failure detectors that provide information about global time but includes all known meaningful failure detectors such as 3S , 3P and P [2]. We show that, within A, the weakest failure ...
متن کامل